Eilenberg-Kelly Reloaded

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Morfeusz Reloaded

The paper presents recent developments in Morfeusz – a morphological analyser for Polish. The program, being already a fundamental resource for processing Polish, has been reimplemented with some important changes in the tagset, some new options, added information on proper names, and ability to perform simple prefix derivation. The present version of Morfeusz (including its dictionaries) is ma...

متن کامل

Sampling Reloaded

Sampling methods are integral to the design of surveys and experiments, to the validity of results, and thus to the study of statistics, social science, and a variety other disciplines that use statistical data. Many probabilistic sampling methods have been proposed in the literature for capturing large amounts of data succinctly. Such methods are bound by the space & time constraint and find d...

متن کامل

Taverna, Reloaded

The Taverna workflow management system is an open source project with a history of widespread adoption within multiple experimental science communities, and a longterm ambition of effectively supporting the evolving need of those communities for complex, data-intensive, service-based experimental pipelines. This paper describes how the recently overhauled technical architecture of Taverna addre...

متن کامل

Equations Reloaded

Eqations is a plugin for the Coq proof assistant which provides a notation for defining programs by dependent pattern-matching and well-founded recursion and derives useful proof principles for demonstrating properties about them. We present here an improved design and rewriting of its implementation that avoids the use of axioms and reliance on Ltac programming, providing a feature-rich functi...

متن کامل

Eilenberg Theorems for Free

Eilenberg-type correspondences, relating varieties of languages (e.g. of finite words, infinite words, or trees) to pseudovarieties of finite algebras, form the backbone of algebraic language theory. Numerous such correspondences are known in the literature. We demonstrate that they all arise from the same recipe: one models languages and the algebras recognizing them by monads on an algebraic ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Theoretical Computer Science

سال: 2020

ISSN: 1571-0661

DOI: 10.1016/j.entcs.2020.09.012